A technique for reconstructing disconnected graphs
نویسندگان
چکیده
منابع مشابه
Gallai's conjecture for disconnected graphs
The path number p(G) of a graph G is the minimum number of paths needed to partition the edge set of G. Gallai conjectured that p(G) b n+1 2 c for every connected graph G of order n. Because of the graph consisting of disjoint triangles, the best one could hope for in the disconnected case is p(G) b 2 3 nc. We prove the sharper result that p(G) 1 2 u + b 2 3 gc where u is the number of odd vert...
متن کاملDistance-locally disconnected graphs
For an integer k ≥ 1, we say that a (finite simple undirected) graph G is k-distance-locally disconnected, or simply k-locally disconnected if, for any x ∈ V (G), the set of vertices at distance at least 1 and at most k from x induces in G a disconnected graph. In this paper we study the asymptotic behavior of the number of edges of a k-locally disconnected graph on n vertices. For general grap...
متن کاملReconstructing a Totally Disconnected Groupoid from Its Ample Semigroup
Recall that an open subset S of a (not necessarily Hausdorff) étale groupoid G is said to be a slice (sometimes also a G-set , or a bissection) if the domain and range maps are injective on S. The collection of all slices forms an inverse semigroup which has often been studied alongside the groupoid itself. Among other things the natural action of this semigroup on the unit space G highlights t...
متن کاملRamsey numbers for small graphs versus small disconnected graphs
The Ramsey number r(G,H) is determined for all disconnected (isolatefree) graphs H of order six and all graphs G of order at most five, except the three cases (G,H) ∈ {(K5 − 2K2, 2K3), (K5 − e, 2K3), (K5, 2K3)} where bounds with difference 1 are established. Moreover, general results are obtained for some small disconnected graphs H and any graph G.
متن کاملReconstruction of p-disconnected graphs
We prove that Kelly-Ulam conjecture is true for p-disconnected graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1973
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-27-1-31-34